Evolutionary search for low autocorrelated binary sequences
نویسندگان
چکیده
| The search for low autocorrelated binary sequences is a classical example of a discrete frustrated optimization problem. We demonstrate the eeciency of a class of evolutionary algorithms to tackle the problem. A suitable mutation operator using a preselection scheme is constructed and the optimal parameters of the strategy are determined.
منابع مشابه
Integrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach
Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...
متن کاملLow-autocorrelation binary sequences: On improved merit factors and runtime predictions to achieve them
Search for binary sequences with a high figure of merit, known as the low autocorrelation binary sequence (labs) problem, represents a formidable computational challenge. In 2003, two stochastic solvers reported computational complexity of O(1.423) and O(1.370), refined to O(1.5097) and O(1.4072) for L odd in this paper. New experiments, with the solver from 2009, demonstrate (a) the asymptotic...
متن کاملA two-sided Bernoulli-based CUSUM control chart with autocorrelated observations
Usually, in monitoring a proportion p < /em>, the binary observations are considered independent; however, in many real cases, there is a continuous stream of autocorrelated binary observations in which a two-state Markov chain model is applied with first-order dependence. On the other hand, the Bernoulli CUSUM control chart which is not robust to autocorrelation can be applied two-sided co...
متن کاملLandscape statistics of the low autocorrelated binary string problem
The statistical properties of the energy landscape of the low autocorrelated binary string problem (LABSP) are studied numerically and compared with those of several classic disordered models. Using two global measures of landscape structure which have been introduced in the Simulated Annealing literature, namely, depth and difficulty, we find that the landscape of LABSP, except perhaps for a v...
متن کاملAn Evolutionary Relationship Between Stearoyl-CoA Desaturase (SCD) Protein Sequences Involved in Fatty Acid Metabolism
Background: Stearoyl-CoA desaturase (SCD) is a key enzyme that converts saturated fatty acids (SFAs) to monounsaturated fatty acids (MUFAs) in fat biosynthesis. Despite being crucial for interpreting SCDs’ roles across species, the evolutionary relationship of SCD proteins across species has yet to be elucidated. This study aims to present this evolutionary relationship based on amino aci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Evolutionary Computation
دوره 2 شماره
صفحات -
تاریخ انتشار 1998